منابع مشابه
Minimal Separating Sets for
For a Muller automaton only a subset of its states is needed to decide whether a run is accepting or not: The set I the innnitely often visited states can be replaced by the intersection I \ W with a xed set W of states, provided W is large enough to distinguish between accepting and non-accepting loops in the automaton. We call such a subset W a separating set. Whereas the idea was previously ...
متن کاملSeparating Collections of Points in Euclidean Spaces
Given two disjoint convex sets A and B in Ed, a hyperplane h in Ed separates them if A lies on one of the half spaces defined by h while B lies on the complementary half space. Given a collection F of convex sets in Ed we say F is separated by a set of hyperplanes H if every pair of elements of F i s separated by some hyperplane of H. We deal here with the case that the convex sets are all poin...
متن کاملLearning Minimal Separating DFA's for Compositional Verification
Algorithms for learning a minimal separating DFA of two disjoint regular languages have been proposed and adapted for different applications. One of the most important applications is learning minimal contextual assumptions in automated compositional verification. We propose in this paper an efficient learning algorithm, called L , that learns and generates a minimal separating DFA. Our algorit...
متن کاملMinimal completely separating systems of sets
Let [n] denote an n-set. A subset,) of [n] i from j if i and j t/:. 5'. A collection of k-sets n called (n, k) completely if, for each ordered pair j) E [n] x [71,] with i n which i from j. Let denote the size of a smallest (71" k) completely Amongst other things, it will be shown that R( 71" k) for n > except when n (Hl) 1, and R(71" k) k + 1 for G) n k 2 /2. These results build on and extend ...
متن کاملMinimal Test Collections for Relevance Feedback
The Information Retrieval Lab at the University of Delaware participated in the Relevance Feedback track at TREC 2009. We used only the Category B subset of the ClueWeb collection; our preprocessing and indexing steps are described in our paper on ad hoc and diversity runs [10]. The second year of the Relevance Feedback track focused on selection of documents for feedback. Our hypothesis is tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1968
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1968-0218261-2